Basic Minimal Total Dominating Functions of Quadratic Residue Cayley Graphs
نویسندگان
چکیده
منابع مشابه
Basic Minimal Total Dominating Functions of Quadratic Residue Cayley Graphs
Domination theory is an important branch of Graph Theory and has many applications in Engineering, Communication Networks and many others. Allan, R.B., and Laskar, R., [1,2], Cockayne, E.J.,and Hedetniemi, S.T., [3], Haynes, T.W., and Slater, J.S., [4], have studied various domination parameters of graphs. Graphs associated with certain arithmetic functions which are usually called arithmetic g...
متن کاملBasic Edge Dominating Functions of Quadratic Residue Cayley Graphs
Graph Theory has been realized as one of the most useful branches of Mathematics of recent origin, finding widest applications in all most all branches of sciences, social sciences, and engineering and computer science. Nathanson[8] was the pioneer in introducing the concepts of NumberTheory, particularly, the “Theory of congruences” i n Graph Theory, thus paving way for the emergence of a new ...
متن کاملEdge Dominating Functions of Quadratic Residue Cayley Graphs
The concept of edge domination is introduced by Mitchell and Hedetniemi [6]. Further results on edge domination are given in Arumugam and Velammal [2]. Functional generalization for vertex subsets has been studied extensively in literature [4, 5]. Cockayne and Mynhardt [3] have introduced that edge subsets may also be embedded into sets of functions and an analogous concept of convexity could a...
متن کاملminimal, vertex minimal and commonality minimal cn-dominating graphs
we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.
متن کاملStructure of the set of all minimal total dominating functions of some classes of graphs
In this paper we study some of the structural properties of the set of all minimal total dominating functions (FT ) of cycles and paths and introduce the idea of function reducible graphs and function separable graphs. It is proved that a function reducible graph is a function separable graph. We shall also see how the idea of function reducibility is used to study the structure of FT (G) for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/8051-1397